On Static and Dynamic Partitioning Behavior of Large-Scale P2P Networks

Adaptive Partitioning of Large-Scale Dynamic Graphs

In the last years, large-scale graph processing has gained increasing attention, with most recent systems placing particular emphasis on latency. One possible technique to improve runtime performance in a distributed graph processing system is to reduce network communication. The most notable way to achieve this goal is to partition the graph by minimizing the number of edges that connect verti...

Services for large scale P2P Networks

Data integration is a significant challenge: relevant data objects are split across multiple information sources, and often owned by different organizations. The sources represent, maintain, and export the information using a variety of formats, interfaces and semantics. This paper addresses the issue of querying distributed data in a large scale context. We present a p2p information mediation ...

DynPart: Dynamic Partitioning for Large-Scale Databases

Static and Dynamic Partitioning of

Identifying some pointers as invisible threads, for the purposes of storage management, is a generalization from several widely used programming conventions, like threaded trees. The necessary invariant is that nodes that are accessible (without threads) emit threads only to other accessible nodes. Dynamic tagging or static typing of threads ameliorates storage recycling both in functional and ...

Parallel Label Correcting Algorithms for Large-Scale Static and Dynamic Transportation Networks On Laptop Personal Computers